Combination Coding: A New Entropy Coding Technique
نویسنده
چکیده
Entropy coding is defined to be the compression of a stream of symbols taken from a known symbol set where the probability of occurrence of any symbol from the set at any given point in the stream is constant and independent of any known occurrences of any other symbols. Shannon and Fano showed that the information of such a sequence could be calculated. When measured in bits the information represents the optimum compressed length of the original sequence. If information about sequential redundancy is known better compression may be possible by one of the substitution coding techniques of Ziv and Lempel. In the absence of any such information, entropy coding provides an optimum coding strategy.
منابع مشابه
Context-based adaptive arithmetic coding in time and frequency domain for the lossless compression of audio coding parameters at variable rate
This paper presents a novel lossless compression technique of the context-based adaptive arithmetic coding which can be used to further compress the quantized parameters in audio codec. The key feature of the new technique is the combination of the context model in time domain and frequency domain which is called time-frequency context model. It is used for the lossless compression of audio cod...
متن کاملLow-Complexity Waveform Coding via Alphabet and Sample-Set Partitioning
We propose a new low-complexity entropy-coding method to be used for coding waveform signals. It is based on the combination of two schemes: (1) an alphabet partitioning method to reduce the complexity of the entropy-coding process; (2) a new recursive set partitioning entropy-coding process that achieves rates smaller than rst order entropy even with fast Hu man adaptive codecs. Numerical resu...
متن کاملMemory-Efficient Recursive Interleaved Entropy Coding
Recursive interleaved entropy coding is a promising new adaptable binary entropy coding technique that offers fast encoding and decoding at high compression efficiency [1]. However, with the encoding methods presented in [1], the maximum memory required by the encoder is proportional to the source sequence length. In this article, we present a new encoding technique, and corresponding decoding ...
متن کاملEfficient Coding of the Classification Table in Low Bit Rate Subband Image Coding by Use of Hierarchical Enumeration
A new method for lossless coding of the classiication table in low bit rate subband image coders with block-wise classiication is proposed. The method is referred to as hierarchical enumeration and uses an algorithmic enumeration technique to associate a xed-length unique binary code-word with each possible combination of integers deening the classiication table. The resulting bit rate is less ...
متن کاملTransform coding with integer-to-integer transforms
A new interpretation of transform coding is developed that downplays quantization and emphasizes entropy coding, allowing a comparison of entropy coding methods with different memory requirements. With conventional transform coding, based on computing Karhunen–Loève transform coefficients and then quantizing them, vector entropy coding can be replaced by scalar entropy coding without an increas...
متن کامل